Scheduling strategy for Real-Time Distributed Systems
نویسندگان
چکیده
منابع مشابه
Power Aware Scheduling for Resource Constrained Distributed Real-Time Systems
Power management has become popular in mobile computing as well as in server farms. Although a lot of work has been done to manage the energy consumption on uniprocessor real-time systems, there is less work done on their multicomputer counterparts. For a set of real-time tasks with precedence and resource constraints executing on a distributed system, we propose a dynamic slack management tech...
متن کاملScheduling and Communication Synthesis for Distributed Real-Time Systems
EMBEDDED SYSTEMS ARE now omnipresent: from cellular phones to pagers, from microwave ovens to PDAs, almost all the devices we use are controlled by embedded systems. Many embedded systems have to fulfill strict requirements in terms of performance and cost efficiency. Emerging designs are usually based on heterogeneous architectures that integrate multiple programmable processors and dedicated ...
متن کاملEnergy Aware Scheduling for Distributed Real-Time Systems
Power management has become popular in mobile computing as well as in server farms. Although a lot of work has been done to manage the energy consumption on uniprocessor real-time systems, there is less work done on their multicomputer counterparts. For a set of real-time tasks with precedence constraints executing on a distributed system, we propose new static and dynamic power management sche...
متن کاملHeuristic Scheduling for Distributed Hard Real-Time Systems
In hard real-time systems it is of crucial importance to meet the speci ed timing constraints. For parallel execution of tasks the need for communication and synchronization among them has to be considered. These requirements of task-sets are represented in the form of precedence graphs. All tasks have to access the Cpu and the network such that the speci ed timing requirements can be guarantee...
متن کاملDynamic Scheduling for Soft Real-Time Distributed Object Systems
Distributed real-time applications require flexible and dynamic scheduling mechanisms to provide timeliness guarantees to application objects. In this paper we present a new scheduling algorithm that exploits the task laxities and the object importances to make effective scheduling decisions. The algorithm uses current timing and resource measurements to determine the feasibility of the tasks a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Research and Technology
سال: 2010
ISSN: 2448-6736,1665-6423
DOI: 10.22201/icat.16656423.2010.8.02.467